Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems

نویسندگان

  • Jochen Alber
  • Hans L. Bodlaender
  • Henning Fernau
  • Rolf Niedermeier
چکیده

We present an algorithm that constructively produces a solution to the k-dominating set problem for planar graphs in time O(c √ n), where c = 36 √ 34. To obtain this result, we show that the treewidth of a planar graph with domination number γ(G) is O( √ γ(G)), and that such a tree decomposition can be found in O( √ γ(G)n) time. The same technique can be used to show that the k-face cover problem (find a size k set of faces that cover all vertices of a given plane graph) can be solved in O(c √ k 1 n + n 2) time, where c1 = 2 36 √ 34 and k is the size of the face cover set. Similar results can be obtained in the planar case for some variants of k-dominating set, e.g., k-independent dominating set and k-weighted dominating set.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs

We present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K5 or K3,3 as a minor in time O(3 6 √ n). In fact, we present our algorithm for any H-minor-free graph where H is a single-crossing graph (can be drawn on the plane with at most one crossing) and obtain the algorithm for K3,3(K5)-minor-free graphs as a special case. As a...

متن کامل

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

We discuss general techniques, centered around the “Layerwise Separation Property” (LSP) of a planar graph problem, that allow to develop algorithms with running time c √ k|G|, given an instance G of a problem on planar graphs with parameter k. Problems having LSP include planar vertex cover, planar independent set, and planar dominating set. Extensions of our speed-up technique to basically al...

متن کامل

Subexponential Algorithms for Partial Cover Problems

Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) the maximum number of edges (or vertices) using a given number (k) of vertices, rather than covering all edges (or vertices). In general graphs, these problems are hard for parameterized complexity classes when paramet...

متن کامل

A Fixed-Parameter Algorithm for Max Edge Domination

In a graph, an edge is said to dominate itself and its adjacent edges. Given an undirected and edge-weighted graph G = (V,E) and an integer k, Max Edge Domination problem (MaxED) is to find a subset K ⊆ E with cardinality at most k such that total weight of edges dominated by K is maximized. MaxED is NP-hard due to the NP-hardness of the minimum edge dominating set problem. In this paper, we pr...

متن کامل

Bidimensional Parameters and Local Treewidth

For several graph theoretic parameters such as vertex cover and dominating set, it is known that if their values are bounded by k then the treewidth of the graph is bounded by some function of k. This fact is used as the main tool for the design of several fixed-parameter algorithms on minor-closed graph classes such as planar graphs, single-crossing-minor-free graphs, and graphs of bounded gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000